Fun with Restricted Delaunay Triangulations

نویسنده

  • Jonathan Richard Shewchuk
چکیده

The restricted Delaunay triangulation is a subcomplex of the three-dimensional Delaunay triangulation that serves as a triangulation of a smooth surface embedded in three-dimensional space. It has proven itself as a mathematically powerful tool for surface meshing and surface reconstruction. I discuss two fascinating mathematical twists on these structures. First, I address a question of Bruno Levy: can we constrain them to include specified edges–that is, can we define mathematically well-behaved constrained Delaunay triangulations on smooth surfaces? Second, the restricted Delaunay triangulation can be conceived as an operator that takes as input a smooth surface and a set of points sampled from that surface, and produces as output a triangulation of the surface. What happens if we feed that triangulation back into the operator, replacing the original surface, while retaining the same sample points? Interestingly, the answer leads us to a method for reconstructing 2-manifolds embedded in high-dimensional spaces. (This work is done jointly with Marc Khoury, Bruno Levy, and Marc van Kreveld.)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Intrinsic Delaunay Triangulations of Submanifolds

We describe an algorithm to construct an intrinsic Delaunay triangulation of a smooth closed submanifold of Euclidean space. Using results established in a companion paper on the stability of Delaunay triangulations on δ-generic point sets, we establish sampling criteria which ensure that the intrinsic Delaunay complex coincides with the restricted Delaunay complex and also with the recently in...

متن کامل

Restricted Constrained Delaunay Triangulations

We introduce the restricted constrained Delaunay triangulation (restricted CDT). The restricted CDT generalizes the restricted Delaunay triangulation, allowing us to define a triangulation of a surface that includes a set of constraining segments. Under certain sampling conditions, the restricted CDT includes every constrained segment and suggests an algorithm that produces a triangulation of t...

متن کامل

Delaunay-restricted Optimal Triangulation of 3D Polygons

Triangulation of 3D polygons is a well studied topic of research. Existing methods for finding triangulations that minimize given metrics (e.g., sum of triangle areas or dihedral angles) run in a costly $O(n^4)$ time \cite{Barequet95,Barequet96}, while the triangulations are not guaranteed to be free of intersections. To address these limitations, we restrict our search to the space of triangle...

متن کامل

Stability of Delaunay-type structures for manifolds

We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex positions. We then show that, for any sufficiently regular submanifold of Euclidean space, and app...

متن کامل

The Stability of Delaunay Triangulations

We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex positions. We quantify the magnitude of the perturbations under which the Delaunay triangulation r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015